Monodic Packed Fragment with Equality is Decidable
نویسنده
چکیده
We prove decidability of satisfiability of sentences of the monodic packed fragment of firstorder temporal logic with equality and connectives Until and Since, in models with various flows of time and domains of arbitrary cardinality. We also prove decidability over models with finite domains, over flows of time including the real order.
منابع مشابه
Handling Equality in Monodic Temporal Resolution
First-order temporal logic is a concise and powerful notation, with many potential applications in both Computer Science and Artificial Intelligence. While the full logic is highly complex, recent work on monodic first-order temporal logics has identified important enumerable and even decidable fragments including the guarded fragment with equality. In this paper, we specialise the monodic reso...
متن کاملMonodic Epistemic Predicate Logic
We consider the monodic formulas of common knowledge predicate logic, which allow applications of epistemic operators to formulas with at most one free variable. We provide nite axiomatizations of the monodic fragment of the most important common knowledge predicate logics (the full logics are known to be not recursively enumerable) and single out a number of their decidable fragments. On the o...
متن کاملCommon knowledge and quanti
The paper consists of two parts. The rst one is a concise introduction to epistemic (both propositional and predicate) logic with common knowledge operator. As the full predicate logics of common knowledge are not even recursively enumerable, in the second part we introduce and investigate the monodic fragment of these logics which allows applications of the epistemic operators to formulas with...
متن کاملCommon Knowledge and Quantiication
The paper consists of two parts. The rst one is a concise introduction to epistemic (both propositional and predicate) logic with common knowl-ege operator. As the full common knowledge predicate logics are not even recursively enumerable, in the second part we introduce and investigate the monodic fragment of these logics which allows applications of the epistemic operators to formulas with at...
متن کاملOn the Computational Complexity of Decidable Fragments of First-Order Linear Temporal Logics
We study the complexity of some fragments of firstorder temporal logic over natural numbers time. The onevariable fragment of linear first-order temporal logic even with sole temporal operator2 is EXPSPACE-complete (this solves an open problem of [10]). So are the one-variable, two-variable and monadic monodic fragments with Until and Since. If we add the operators n, with n given in binary, th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Studia Logica
دوره 72 شماره
صفحات -
تاریخ انتشار 2002